On Closedness Conditions, Strong Separation, and Convex Duality
نویسنده
چکیده
In the paper, we describe various applications of the closedness and duality theorems of [7] and [8]. First, the strong separability of a polyhedron and a linear image of a convex set is characterized. Then, it is shown how stability conditions (known from the generalized Fenchel-Rockafellar duality theory) can be reformulated as closedness conditions. Finally, we present a generalized Lagrange duality theorem for Lagrange programs described with cone-convex/cone-polyhedral mappings. Mathematics Subject Classifications (2000). 90C46, 90C25, 52A41.
منابع مشابه
On Abrams’ theorem
Abrams’ theorem describes a necessary and sufficient condition for the closedness of a linear image of an arbitrary set. Closedness conditions of this type play an important role in the theory of duality in convex programming. In this paper we present generalizations of Abrams’ theorem, as well as Abrams-type theorems characterizing other properties (such as relatively openness or polyhedrality...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملOn the closedness of the algebraic difference of closed convex sets
We characterize in a reflexive Banach space all the closed convex sets containing no lines for which the condition ensures the closedness of the algebraic difference for all closed convex sets . We also answer a closely related problem: determine all the pairs , of closed convex sets containing no lines such that the algebraic difference of any sufficiently small uniform perturbation of and rem...
متن کاملA closedness condition and its applications to DC programs with convex constraints
This paper concerns a closedness condition called (CC), requiring a convex function and a convex constrained system. This type of condition has played an important role in the study of convex optimization problems. Our aim is to establish several characterizations of this condition and to apply them to study minimizing problems involving a DC function under a cone-convex constraint and a set co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 21 شماره
صفحات -
تاریخ انتشار 2013